more on this theme     |     more from this thinker     |     more from this text

---

Single Idea 10088

[filed under theme 5. Theory of Logic / K. Features of Logics / 7. Decidability ]

Full Idea

Any consistent, axiomatized, negation-complete formal theory is decidable.

Gist of Idea

Any consistent, axiomatized, negation-complete formal theory is decidable

Source

Peter Smith (Intro to Gödel's Theorems [2007], 03.6)

Book Ref

Smith,Peter: 'An Introduction to Gödel's Theorems' [CUP 2007], p.26